<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html lang="en" dir="ltr" class="client-nojs">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>Standard library header &lt;algorithm&gt; - cppreference.com</title>
<meta charset="UTF-8">
<meta name="generator" content="MediaWiki 1.21.2">


<link rel="shortcut icon" href="../../../favicon.ico">



<link rel="stylesheet" href="../../../common/ext.css">
<meta name="ResourceLoaderDynamicStyles" content="">
<link rel="stylesheet" href="../../../common/site_modules.css">
<style>a:lang(ar),a:lang(ckb),a:lang(fa),a:lang(kk-arab),a:lang(mzn),a:lang(ps),a:lang(ur){text-decoration:none}#toc{display:none}.editsection{display:none}
/* cache key: mwiki1-mwiki_en_:resourceloader:filter:minify-css:7:472787eddcf4605d11de8c7ef047234f */</style>

<script src="../../../common/startup_scripts.js"></script>
<script>if(window.mw){
mw.config.set({"wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"cpp/header/algorithm","wgTitle":"cpp/header/algorithm","wgCurRevisionId":57426,"wgArticleId":9750,"wgIsArticle":true,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":[],"wgBreakFrames":false,"wgPageContentLanguage":"en","wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy","wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgMonthNamesShort":["","Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"],"wgRelevantPageName":"cpp/header/algorithm","wgRestrictionEdit":[],"wgRestrictionMove":[]});
}</script><script>if(window.mw){
mw.loader.implement("user.options",function(){mw.user.options.set({"ccmeonemails":0,"cols":80,"date":"default","diffonly":0,"disablemail":0,"disablesuggest":0,"editfont":"default","editondblclick":0,"editsection":0,"editsectiononrightclick":0,"enotifminoredits":0,"enotifrevealaddr":0,"enotifusertalkpages":1,"enotifwatchlistpages":0,"extendwatchlist":0,"externaldiff":0,"externaleditor":0,"fancysig":0,"forceeditsummary":0,"gender":"unknown","hideminor":0,"hidepatrolled":0,"imagesize":2,"justify":0,"math":1,"minordefault":0,"newpageshidepatrolled":0,"nocache":0,"noconvertlink":0,"norollbackdiff":0,"numberheadings":0,"previewonfirst":0,"previewontop":1,"quickbar":5,"rcdays":7,"rclimit":50,"rememberpassword":0,"rows":25,"searchlimit":20,"showhiddencats":0,"showjumplinks":1,"shownumberswatching":1,"showtoc":0,"showtoolbar":1,"skin":"cppreference2","stubthreshold":0,"thumbsize":2,"underline":2,"uselivepreview":0,"usenewrc":0,"watchcreations":0,"watchdefault":0,"watchdeletion":0,
"watchlistdays":3,"watchlisthideanons":0,"watchlisthidebots":0,"watchlisthideliu":0,"watchlisthideminor":0,"watchlisthideown":0,"watchlisthidepatrolled":0,"watchmoves":0,"wllimit":250,"variant":"en","language":"en","searchNs0":true,"searchNs1":false,"searchNs2":false,"searchNs3":false,"searchNs4":false,"searchNs5":false,"searchNs6":false,"searchNs7":false,"searchNs8":false,"searchNs9":false,"searchNs10":false,"searchNs11":false,"searchNs12":false,"searchNs13":false,"searchNs14":false,"searchNs15":false,"gadget-ColiruCompiler":1});;},{},{});mw.loader.implement("user.tokens",function(){mw.user.tokens.set({"editToken":"+\\","patrolToken":false,"watchToken":false});;},{},{});
/* cache key: mwiki1-mwiki_en_:resourceloader:filter:minify-js:7:ca03345b1e2c4d90a25d968753a73b92 */
}</script>
<script>if(window.mw){
mw.loader.load(["mediawiki.page.startup","mediawiki.legacy.wikibits","mediawiki.legacy.ajax"]);
}</script>
<style type="text/css">/*<![CDATA[*/
.source-cpp {line-height: normal;}
.source-cpp li, .source-cpp pre {
	line-height: normal; border: 0px none white;
}
/**
 * GeSHi Dynamically Generated Stylesheet
 * --------------------------------------
 * Dynamically generated stylesheet for cpp
 * CSS class: source-cpp, CSS id: 
 * GeSHi (C) 2004 - 2007 Nigel McNie, 2007 - 2008 Benny Baumann
 * (http://qbnz.com/highlighter/ and http://geshi.org/)
 * --------------------------------------
 */
.cpp.source-cpp .de1, .cpp.source-cpp .de2 {font: normal normal 1em/1.2em monospace; margin:0; padding:0; background:none; vertical-align:top;}
.cpp.source-cpp  {font-family:monospace;}
.cpp.source-cpp .imp {font-weight: bold; color: red;}
.cpp.source-cpp li, .cpp.source-cpp .li1 {font-weight: normal; vertical-align:top;}
.cpp.source-cpp .ln {width:1px;text-align:right;margin:0;padding:0 2px;vertical-align:top;}
.cpp.source-cpp .li2 {font-weight: bold; vertical-align:top;}
.cpp.source-cpp .kw1 {color: #0000dd;}
.cpp.source-cpp .kw2 {color: #0000ff;}
.cpp.source-cpp .kw3 {color: #0000dd;}
.cpp.source-cpp .kw4 {color: #0000ff;}
.cpp.source-cpp .co1 {color: #909090;}
.cpp.source-cpp .co2 {color: #339900;}
.cpp.source-cpp .coMULTI {color: #ff0000; font-style: italic;}
.cpp.source-cpp .es0 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es1 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es2 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es3 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es4 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es5 {color: #008000; font-weight: bold;}
.cpp.source-cpp .br0 {color: #008000;}
.cpp.source-cpp .sy0 {color: #008000;}
.cpp.source-cpp .sy1 {color: #000080;}
.cpp.source-cpp .sy2 {color: #000040;}
.cpp.source-cpp .sy3 {color: #000040;}
.cpp.source-cpp .sy4 {color: #008080;}
.cpp.source-cpp .st0 {color: #008000;}
.cpp.source-cpp .nu0 {color: #000080;}
.cpp.source-cpp .nu6 {color: #000080;}
.cpp.source-cpp .nu8 {color: #000080;}
.cpp.source-cpp .nu12 {color: #000080;}
.cpp.source-cpp .nu16 {color:#000080;}
.cpp.source-cpp .nu17 {color:#000080;}
.cpp.source-cpp .nu18 {color:#000080;}
.cpp.source-cpp .nu19 {color:#000080;}
.cpp.source-cpp .ln-xtra, .cpp.source-cpp li.ln-xtra, .cpp.source-cpp div.ln-xtra {background-color: #ffc;}
.cpp.source-cpp span.xtra { display:block; }

/*]]>*/
</style>
<!--[if lt IE 7]><style type="text/css">body{behavior:url("/mwiki/skins/cppreference2/csshover.min.htc")}</style><![endif]-->
</head>
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_header_algorithm skin-cppreference2 action-view cpp-navbar">
        <!-- header -->
        
        <!-- /header -->
        <!-- content -->
        <div id="cpp-content-base">
            <div id="content">
                <a id="top"></a>
                <div id="mw-js-message" style="display:none;"></div>
                                <!-- firstHeading -->
                <h1 id="firstHeading" class="firstHeading">
<span style="font-size:0.7em; line-height:130%">Standard library header</span> &lt;algorithm&gt;</h1>
                <!-- /firstHeading -->
                <!-- bodyContent -->
                <div id="bodyContent">
                                        <!-- tagline -->
                    <div id="siteSub">From cppreference.com</div>
                    <!-- /tagline -->
                                        <!-- subtitle -->
                    <div id="contentSub"><span class="subpages">&lt; <a href="../../cpp.html" title="cpp">cpp</a>‎ | <a href="../header.html" title="cpp/header">header</a></span></div>
                    <!-- /subtitle -->
                                                            <!-- bodycontent -->
                    <div id="mw-content-text" lang="en" dir="ltr" class="mw-content-ltr">
<div class="t-navbar" style="">
<div class="t-navbar-sep"> </div>
<div class="t-navbar-head">
<a href="../../cpp.html" title="cpp"> C++</a><div class="t-navbar-menu"><div>
<div><table class="t-nv-begin" cellpadding="0" style="line-height:1.1em;">
<tr class="t-nv"><td colspan="5"> <a href="../language.1.html" title="cpp/language"> Language</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../header.html" title="cpp/header"> Standard library headers</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../concept.html" title="cpp/concept"> Concepts</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../utility.html" title="cpp/utility"> Utilities library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../string.html" title="cpp/string"> Strings library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../container.html" title="cpp/container"> Containers library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../algorithm.html" title="cpp/algorithm"> Algorithms library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../iterator.html" title="cpp/iterator"> Iterators library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../numeric.html" title="cpp/numeric"> Numerics library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../io.html" title="cpp/io"> Input/output library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../locale.html" title="cpp/locale"> Localizations library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../regex.html" title="cpp/regex"> Regular expressions library</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../atomic.html" title="cpp/atomic"> Atomic operations library</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../thread.html" title="cpp/thread"> Thread support library</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
</table></div>
<div></div>
</div></div>
</div>
<div class="t-navbar-sep"> </div>
<div class="t-navbar-head">
<a href="../header.html" title="cpp/header"> Standard Library header files </a><div class="t-navbar-menu"><div>
<div style="display:inline-block">
<div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv-h1"><td colspan="5"> Language Support</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cstddef.html" title="cpp/header/cstddef"><tt>&lt;cstddef&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="limits.html" title="cpp/header/limits"><tt>&lt;limits&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="climits.html" title="cpp/header/climits"><tt>&lt;climits&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cfloat.html" title="cpp/header/cfloat"><tt>&lt;cfloat&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdint.html" title="cpp/header/cstdint"><tt>&lt;cstdint&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="new.html" title="cpp/header/new"><tt>&lt;new&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="typeinfo.html" title="cpp/header/typeinfo"><tt>&lt;typeinfo&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="exception.html" title="cpp/header/exception"><tt>&lt;exception&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ciso646.html" title="cpp/header/ciso646"><tt>&lt;ciso646&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="initializer_list.html" title="cpp/header/initializer list"><tt>&lt;initializer_list&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="csignal.html" title="cpp/header/csignal"><tt>&lt;csignal&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="csetjmp.html" title="cpp/header/csetjmp"><tt>&lt;csetjmp&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdalign.html" title="cpp/header/cstdalign"><tt>&lt;cstdalign&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdarg.html" title="cpp/header/cstdarg"><tt>&lt;cstdarg&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdbool.html" title="cpp/header/cstdbool"><tt>&lt;cstdbool&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt>&lt;cstdlib&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ctime.html" title="cpp/header/ctime"><tt>&lt;ctime&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> Diagnostics</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="stdexcept.html" title="cpp/header/stdexcept"><tt>&lt;stdexcept&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cassert.html" title="cpp/header/cassert"><tt>&lt;cassert&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cerrno.html" title="cpp/header/cerrno"><tt>&lt;cerrno&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="system_error.html" title="cpp/header/system error"><tt>&lt;system_error&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> General utilities</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="utility.html" title="cpp/header/utility"><tt>&lt;utility&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="tuple.html" title="cpp/header/tuple"><tt>&lt;tuple&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="bitset.html" title="cpp/header/bitset"><tt>&lt;bitset&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="memory.html" title="cpp/header/memory"><tt>&lt;memory&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt>&lt;cstdlib&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstring.html" title="cpp/header/cstring"><tt>&lt;cstring&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="functional.html" title="cpp/header/functional"><tt>&lt;functional&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="type_traits.html" title="cpp/header/type traits"><tt>&lt;type_traits&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ratio.html" title="cpp/header/ratio"><tt>&lt;ratio&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="chrono.html" title="cpp/header/chrono"><tt>&lt;chrono&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ctime.html" title="cpp/header/ctime"><tt>&lt;ctime&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="scoped_allocator.html" title="cpp/header/scoped allocator"><tt>&lt;scoped_allocator&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="typeindex.html" title="cpp/header/typeindex"><tt>&lt;typeindex&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> Strings</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="string.html" title="cpp/header/string"><tt>&lt;string&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cctype.html" title="cpp/header/cctype"><tt>&lt;cctype&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cwctype.html" title="cpp/header/cwctype"><tt>&lt;cwctype&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstring.html" title="cpp/header/cstring"><tt>&lt;cstring&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cwchar.html" title="cpp/header/cwchar"><tt>&lt;cwchar&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt>&lt;cstdlib&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cuchar.html" title="cpp/header/cuchar"><tt>&lt;cuchar&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> Localization</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="locale.html" title="cpp/header/locale"><tt>&lt;locale&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="codectv.html" title="cpp/header/codectv" class="mw-redirect"><tt>&lt;codectv&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="clocale.html" title="cpp/header/clocale"><tt>&lt;clocale&gt;</tt></a>
</td></tr>
</table></div></td></tr>
</table></div>
</div>
<div style="display:inline-block">
<div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv-h1"><td colspan="5"> Containers</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="array.html" title="cpp/header/array"><tt>&lt;array&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="deque.html" title="cpp/header/deque"><tt>&lt;deque&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="forward_list.html" title="cpp/header/forward list"><tt>&lt;forward_list&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="list.html" title="cpp/header/list"><tt>&lt;list&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="vector.html" title="cpp/header/vector"><tt>&lt;vector&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="map.html" title="cpp/header/map"><tt>&lt;map&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="set.html" title="cpp/header/set"><tt>&lt;set&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="unordered_map.html" title="cpp/header/unordered map"><tt>&lt;unordered_map&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="unordered_set.html" title="cpp/header/unordered set"><tt>&lt;unordered_set&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="queue.html" title="cpp/header/queue"><tt>&lt;queue&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="stack.html" title="cpp/header/stack"><tt>&lt;stack&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> Iterators</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="iterator.html" title="cpp/header/iterator"><tt>&lt;iterator&gt;</tt></a>
</td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Algorithms</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <strong class="selflink"><tt>&lt;algorithm&gt;</tt></strong>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt>&lt;cstdlib&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> Numerics</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cfenv.html" title="cpp/header/cfenv"><tt>&lt;cfenv&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="complex.html" title="cpp/header/complex"><tt>&lt;complex&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="random.html" title="cpp/header/random"><tt>&lt;random&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="valarray.html" title="cpp/header/valarray"><tt>&lt;valarray&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="numeric.html" title="cpp/header/numeric"><tt>&lt;numeric&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cmath.html" title="cpp/header/cmath"><tt>&lt;cmath&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ctgmath.html" title="cpp/header/ctgmath"><tt>&lt;ctgmath&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt>&lt;cstdlib&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> Input/Output</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="iosfwd.html" title="cpp/header/iosfwd"><tt>&lt;iosfwd&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="iostream.html" title="cpp/header/iostream"><tt>&lt;iostream&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ios.html" title="cpp/header/ios"><tt>&lt;ios&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="streambuf.html" title="cpp/header/streambuf"><tt>&lt;streambuf&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="istream.html" title="cpp/header/istream"><tt>&lt;istream&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ostream.html" title="cpp/header/ostream"><tt>&lt;ostream&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="iomanip.html" title="cpp/header/iomanip"><tt>&lt;iomanip&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="sstream.html" title="cpp/header/sstream"><tt>&lt;sstream&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="fstream.html" title="cpp/header/fstream"><tt>&lt;fstream&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdio.html" title="cpp/header/cstdio"><tt>&lt;cstdio&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cinttypes.html" title="cpp/header/cinttypes"><tt>&lt;cinttypes&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
<tr class="t-nv-h1"><td colspan="5"> Regular expressions</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="regex.html" title="cpp/header/regex"><tt>&lt;regex&gt;</tt></a>
</td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Thread support</td></tr>
<tr class="t-nv-col-table">
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="thread.html" title="cpp/header/thread"><tt>&lt;thread&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="mutex.html" title="cpp/header/mutex"><tt>&lt;mutex&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="atomic.html" title="cpp/header/atomic"><tt>&lt;atomic&gt;</tt></a>
</td></tr>
</table></div></td>
<td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="shared_mutex.html" title="cpp/header/shared mutex"><tt>&lt;shared_mutex&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="condition_variable.html" title="cpp/header/condition variable"><tt>&lt;condition_variable&gt;</tt></a>
</td></tr>
<tr class="t-nv"><td colspan="5"> <a href="future.html" title="cpp/header/future"><tt>&lt;future&gt;</tt></a>
</td></tr>
</table></div></td>
</tr>
</table></div>
</div>
<div></div>
</div></div>
</div>
<div class="t-navbar-sep"> </div>
</div>
<p>This header is part of the <a href="../algorithm.html" title="cpp/algorithm">algorithm</a> library.
</p>
<table id="toc" class="toc"><tr><td>
<div id="toctitle"><h2>Contents</h2></div>
<ul>
<li class="toclevel-1 tocsection-1">
<a href="algorithm.html%23Functions"><span class="tocnumber">1</span> <span class="toctext">Functions</span></a>
<ul>
<li class="toclevel-2"><a href="algorithm.html%23Non-modifying_sequence_operations"><span class="tocnumber">1.1</span> <span class="toctext">Non-modifying sequence operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html%23Modifying_sequence_operations"><span class="tocnumber">1.2</span> <span class="toctext">Modifying sequence operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html%23Partitioning_operations"><span class="tocnumber">1.3</span> <span class="toctext">Partitioning operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html%23Sorting_operations_.28on_sorted_ranges.29"><span class="tocnumber">1.4</span> <span class="toctext">Sorting operations (on sorted ranges)</span></a></li>
<li class="toclevel-2"><a href="algorithm.html%23Binary_search_operations_.28on_sorted_ranges.29"><span class="tocnumber">1.5</span> <span class="toctext">Binary search operations (on sorted ranges)</span></a></li>
<li class="toclevel-2"><a href="algorithm.html%23Set_operations_.28on_sorted_ranges.29"><span class="tocnumber">1.6</span> <span class="toctext">Set operations (on sorted ranges)</span></a></li>
<li class="toclevel-2"><a href="algorithm.html%23Heap_operations"><span class="tocnumber">1.7</span> <span class="toctext">Heap operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html%23Minimum.2Fmaximum_operations"><span class="tocnumber">1.8</span> <span class="toctext">Minimum/maximum operations</span></a></li>
</ul>
</li>
<li class="toclevel-1 tocsection-2"><a href="algorithm.html%23Synopsis"><span class="tocnumber">2</span> <span class="toctext">Synopsis</span></a></li>
</ul>
</td></tr></table>
<h3>
<span class="editsection">[<a href="http%3A//en.cppreference.com/mwiki/index.php" title="Edit section: Functions">edit</a>]</span> <span class="mw-headline" id="Functions">Functions</span>
</h3>
<table class="t-dsc-begin">

<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Non-modifying_sequence_operations">  Non-modifying sequence operations </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/all_any_none_of.html" title="cpp/algorithm/all any none of"> <span class="t-lines"><span>all_of</span><span>any_of</span><span>none_of</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   checks if a predicate is <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> for all, any or none of the elements in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/for_each.html" title="cpp/algorithm/for each"> <span class="t-lines"><span>for_each</span></span></a></div></div>
</td>
<td>   applies a function to a range of elements <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/count.html" title="cpp/algorithm/count"> <span class="t-lines"><span>count</span><span>count_if</span></span></a></div></div>
</td>
<td>   returns the number of elements satisfying specific criteria  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/mismatch.html" title="cpp/algorithm/mismatch"> <span class="t-lines"><span>mismatch</span></span></a></div></div>
</td>
<td>   finds the first position where two ranges differ  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/equal.html" title="cpp/algorithm/equal"> <span class="t-lines"><span>equal</span></span></a></div></div>
</td>
<td>   determines if two sets of elements are the same  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/find.html" title="cpp/algorithm/find"> <span class="t-lines"><span>find</span><span>find_if</span><span>find_if_not</span></span></a></div>
<div><span class="t-lines"><span></span><span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   finds the first element satisfying specific criteria  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/find_end.html" title="cpp/algorithm/find end"> <span class="t-lines"><span>find_end</span></span></a></div></div>
</td>
<td>   finds the last sequence of elements in a certain range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/find_first_of.html" title="cpp/algorithm/find first of"> <span class="t-lines"><span>find_first_of</span></span></a></div></div>
</td>
<td>   searches for any one of a set of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/adjacent_find.html" title="cpp/algorithm/adjacent find"> <span class="t-lines"><span>adjacent_find</span></span></a></div></div>
</td>
<td>   finds the first two adjacent items that are equal (or satisfy a given predicate)  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/search.html" title="cpp/algorithm/search"> <span class="t-lines"><span>search</span></span></a></div></div>
</td>
<td>   searches for a range of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/search_n.html" title="cpp/algorithm/search n"> <span class="t-lines"><span>search_n</span></span></a></div></div>
</td>
<td>   searches for a number consecutive copies of an element in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>


<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Modifying_sequence_operations">  Modifying sequence operations </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/copy.html" title="cpp/algorithm/copy"> <span class="t-lines"><span>copy</span><span>copy_if</span></span></a></div>
<div><span class="t-lines"><span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   copies a range of elements to a new location  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/copy_n.html" title="cpp/algorithm/copy n"> <span class="t-lines"><span>copy_n</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   copies a number of elements to a new location  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/copy_backward.html" title="cpp/algorithm/copy backward"> <span class="t-lines"><span>copy_backward</span></span></a></div></div>
</td>
<td>   copies a range of elements in backwards order  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/move.html" title="cpp/algorithm/move"> <span class="t-lines"><span>move</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   moves a range of elements to a new location  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/move_backward.html" title="cpp/algorithm/move backward"> <span class="t-lines"><span>move_backward</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   moves a range of elements to a new location in backwards order  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/fill.html" title="cpp/algorithm/fill"> <span class="t-lines"><span>fill</span></span></a></div></div>
</td>
<td>   assigns a range of elements a certain value  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/fill_n.html" title="cpp/algorithm/fill n"> <span class="t-lines"><span>fill_n</span></span></a></div></div>
</td>
<td>   assigns a value to a number of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/transform.html" title="cpp/algorithm/transform"> <span class="t-lines"><span>transform</span></span></a></div></div>
</td>
<td>   applies a function to a range of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/generate.html" title="cpp/algorithm/generate"> <span class="t-lines"><span>generate</span></span></a></div></div>
</td>
<td>   saves the result of a function in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/generate_n.html" title="cpp/algorithm/generate n"> <span class="t-lines"><span>generate_n</span></span></a></div></div>
</td>
<td>   saves the result of N applications of a function  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/remove.html" title="cpp/algorithm/remove"> <span class="t-lines"><span>remove</span><span>remove_if</span></span></a></div></div>
</td>
<td>   removes elements satisfying specific criteria  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/remove_copy.html" title="cpp/algorithm/remove copy"> <span class="t-lines"><span>remove_copy</span><span>remove_copy_if</span></span></a></div></div>
</td>
<td>   copies a range of elements omitting those that satisfy specific criteria  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/replace.html" title="cpp/algorithm/replace"> <span class="t-lines"><span>replace</span><span>replace_if</span></span></a></div></div>
</td>
<td>   replaces all values satisfying specific criteria with another value  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/replace_copy.html" title="cpp/algorithm/replace copy"> <span class="t-lines"><span>replace_copy</span><span>replace_copy_if</span></span></a></div></div>
</td>
<td>   copies a range, replacing elements satisfying specific criteria with another value  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/swap.html" title="cpp/algorithm/swap"> <span class="t-lines"><span>swap</span></span></a></div></div>
</td>
<td>   swaps the values of two objects  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/swap_ranges.html" title="cpp/algorithm/swap ranges"> <span class="t-lines"><span>swap_ranges</span></span></a></div></div>
</td>
<td>   swaps two ranges of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/iter_swap.html" title="cpp/algorithm/iter swap"> <span class="t-lines"><span>iter_swap</span></span></a></div></div>
</td>
<td>   swaps the elements pointed to by two iterators  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/reverse.html" title="cpp/algorithm/reverse"> <span class="t-lines"><span>reverse</span></span></a></div></div>
</td>
<td>   reverses the order elements in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/reverse_copy.html" title="cpp/algorithm/reverse copy"> <span class="t-lines"><span>reverse_copy</span></span></a></div></div>
</td>
<td>   creates a copy of a range that is reversed  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/rotate.html" title="cpp/algorithm/rotate"> <span class="t-lines"><span>rotate</span></span></a></div></div>
</td>
<td>   rotates the order of elements in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/rotate_copy.html" title="cpp/algorithm/rotate copy"> <span class="t-lines"><span>rotate_copy</span></span></a></div></div>
</td>
<td>   copies and rotate a range of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/random_shuffle.html" title="cpp/algorithm/random shuffle"> <span class="t-lines"><span>random_shuffle</span><span>shuffle</span></span></a></div>
<div><span class="t-lines"><span> </span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   randomly re-orders elements in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/unique.html" title="cpp/algorithm/unique"> <span class="t-lines"><span>unique</span></span></a></div></div>
</td>
<td>   removes consecutive duplicate elements in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/unique_copy.html" title="cpp/algorithm/unique copy"> <span class="t-lines"><span>unique_copy</span></span></a></div></div>
</td>
<td>   creates a copy of some range of elements that contains no consecutive duplicates  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>


<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Partitioning_operations">  Partitioning operations </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/is_partitioned.html" title="cpp/algorithm/is partitioned"> <span class="t-lines"><span>is_partitioned</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   determines if the range is partitioned by the given predicate  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/partition.html" title="cpp/algorithm/partition"> <span class="t-lines"><span>partition</span></span></a></div></div>
</td>
<td>   divides a range of elements into two groups  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/partition_copy.html" title="cpp/algorithm/partition copy"> <span class="t-lines"><span>partition_copy</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   copies a range dividing the elements into two groups  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/stable_partition.html" title="cpp/algorithm/stable partition"> <span class="t-lines"><span>stable_partition</span></span></a></div></div>
</td>
<td>   divides elements into two groups while preserving their relative order  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/partition_point.html" title="cpp/algorithm/partition point"> <span class="t-lines"><span>partition_point</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   locates the partition point of a partitioned range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>


<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Sorting_operations_.28on_sorted_ranges.29">  Sorting operations (on sorted ranges) </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/is_sorted.html" title="cpp/algorithm/is sorted"> <span class="t-lines"><span>is_sorted</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   checks whether a range is sorted into ascending order  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/is_sorted_until.html" title="cpp/algorithm/is sorted until"> <span class="t-lines"><span>is_sorted_until</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   finds the largest sorted subrange  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/sort.html" title="cpp/algorithm/sort"> <span class="t-lines"><span>sort</span></span></a></div></div>
</td>
<td>   sorts a range into ascending order  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/partial_sort.html" title="cpp/algorithm/partial sort"> <span class="t-lines"><span>partial_sort</span></span></a></div></div>
</td>
<td>   sorts the first N elements of a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/partial_sort_copy.html" title="cpp/algorithm/partial sort copy"> <span class="t-lines"><span>partial_sort_copy</span></span></a></div></div>
</td>
<td>   copies and partially sorts a range of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/stable_sort.html" title="cpp/algorithm/stable sort"> <span class="t-lines"><span>stable_sort</span></span></a></div></div>
</td>
<td>   sorts a range of elements while preserving order between equal elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/nth_element.html" title="cpp/algorithm/nth element"> <span class="t-lines"><span>nth_element</span></span></a></div></div>
</td>
<td>   partially sorts the given range making sure that it is partitioned by the given element  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>


<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Binary_search_operations_.28on_sorted_ranges.29">  Binary search operations (on sorted ranges) </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/lower_bound.html" title="cpp/algorithm/lower bound"> <span class="t-lines"><span>lower_bound</span></span></a></div></div>
</td>
<td>   returns an iterator to the first element <i>not less</i> than the given value <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/upper_bound.html" title="cpp/algorithm/upper bound"> <span class="t-lines"><span>upper_bound</span></span></a></div></div>
</td>
<td>   returns an iterator to the first element <i>greater</i> than a certain value <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/binary_search.html" title="cpp/algorithm/binary search"> <span class="t-lines"><span>binary_search</span></span></a></div></div>
</td>
<td>   determines if an element exists in a certain range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/equal_range.html" title="cpp/algorithm/equal range"> <span class="t-lines"><span>equal_range</span></span></a></div></div>
</td>
<td>   returns range of elements matching a specific key <br> <span class="t-mark">(function template)</span> 
</td>
</tr>


<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Set_operations_.28on_sorted_ranges.29">  Set operations (on sorted ranges) </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/merge.html" title="cpp/algorithm/merge"> <span class="t-lines"><span>merge</span></span></a></div></div>
</td>
<td>   merges two sorted ranges  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/inplace_merge.html" title="cpp/algorithm/inplace merge"> <span class="t-lines"><span>inplace_merge</span></span></a></div></div>
</td>
<td>   merges two ordered ranges in-place  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/includes.html" title="cpp/algorithm/includes"> <span class="t-lines"><span>includes</span></span></a></div></div>
</td>
<td>   returns true if one set is a subset of another  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/set_difference.html" title="cpp/algorithm/set difference"> <span class="t-lines"><span>set_difference</span></span></a></div></div>
</td>
<td>   computes the difference between two sets  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/set_intersection.html" title="cpp/algorithm/set intersection"> <span class="t-lines"><span>set_intersection</span></span></a></div></div>
</td>
<td>   computes the intersection of two sets  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/set_symmetric_difference.html" title="cpp/algorithm/set symmetric difference"> <span class="t-lines"><span>set_symmetric_difference</span></span></a></div></div>
</td>
<td>   computes the symmetric difference between two sets  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/set_union.html" title="cpp/algorithm/set union"> <span class="t-lines"><span>set_union</span></span></a></div></div>
</td>
<td>   computes the union of two sets  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>


<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Heap_operations">  Heap operations </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/is_heap.html" title="cpp/algorithm/is heap"> <span class="t-lines"><span>is_heap</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   checks if the given range is a max heap <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/is_heap_until.html" title="cpp/algorithm/is heap until"> <span class="t-lines"><span>is_heap_until</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   finds the largest subrange that is a max heap  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/make_heap.html" title="cpp/algorithm/make heap"> <span class="t-lines"><span>make_heap</span></span></a></div></div>
</td>
<td>   creates a max heap out of a range of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/push_heap.html" title="cpp/algorithm/push heap"> <span class="t-lines"><span>push_heap</span></span></a></div></div>
</td>
<td>   adds an element to a max heap  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/pop_heap.html" title="cpp/algorithm/pop heap"> <span class="t-lines"><span>pop_heap</span></span></a></div></div>
</td>
<td>   removes the largest element from a max heap  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/sort_heap.html" title="cpp/algorithm/sort heap"> <span class="t-lines"><span>sort_heap</span></span></a></div></div>
</td>
<td>   turns a max heap into a range of elements sorted in ascending order  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>


<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Minimum.2Fmaximum_operations">  Minimum/maximum operations </span>
</h5>
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/max.html" title="cpp/algorithm/max"> <span class="t-lines"><span>max</span></span></a></div></div>
</td>
<td>   returns the larger of two elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/max_element.html" title="cpp/algorithm/max element"> <span class="t-lines"><span>max_element</span></span></a></div></div>
</td>
<td>   returns the largest element in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/min.html" title="cpp/algorithm/min"> <span class="t-lines"><span>min</span></span></a></div></div>
</td>
<td>   returns the smaller of two elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/min_element.html" title="cpp/algorithm/min element"> <span class="t-lines"><span>min_element</span></span></a></div></div>
</td>
<td>   returns the smallest element in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/minmax.html" title="cpp/algorithm/minmax"> <span class="t-lines"><span>minmax</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   returns the larger and the smaller of two elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/minmax_element.html" title="cpp/algorithm/minmax element"> <span class="t-lines"><span>minmax_element</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   returns the smallest and the largest element in a range  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/lexicographical_compare.html" title="cpp/algorithm/lexicographical compare"> <span class="t-lines"><span>lexicographical_compare</span></span></a></div></div>
</td>
<td>   returns true if one range is lexicographically less than another  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div">
<div><a href="../algorithm/is_permutation.html" title="cpp/algorithm/is permutation"> <span class="t-lines"><span>is_permutation</span></span></a></div>
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
</div>
</td>
<td>   determines if a sequence is a permutation of another sequence  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/next_permutation.html" title="cpp/algorithm/next permutation"> <span class="t-lines"><span>next_permutation</span></span></a></div></div>
</td>
<td>   generates the next greater lexicographic permutation of a range of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>

<tr class="t-dsc-sep">
<td colspan="2">
</td>
</tr>
<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="../algorithm/prev_permutation.html" title="cpp/algorithm/prev permutation"> <span class="t-lines"><span>prev_permutation</span></span></a></div></div>
</td>
<td>   generates the next smaller lexicographic permutation of a range of elements  <br> <span class="t-mark">(function template)</span> 
</td>
</tr>
</table>
<h3>
<span class="editsection">[<a href="http%3A//en.cppreference.com/mwiki/index.php" title="Edit section: Synopsis">edit</a>]</span> <span class="mw-headline" id="Synopsis">Synopsis</span>
</h3>
<div dir="ltr" class="mw-geshi" style="text-align: left;"><div class="cpp source-cpp"><pre class="de1"><span class="co2">#include &lt;initializer_list&gt;</span>
<span class="kw1">namespace</span> std
<span class="br0">{</span>
    <span class="co1">// non-modifying sequence operations:</span>
    <span class="kw1">template</span> <span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> all_of<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span> <span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> any_of<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span> <span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> none_of<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Function<span class="sy1">&gt;</span>
        Function for_each<span class="br0">(</span>InputIterator first, InputIterator last, Function f<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        InputIterator find<span class="br0">(</span>InputIterator first, InputIterator last,
                           <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        InputIterator find_if<span class="br0">(</span>InputIterator first, InputIterator last,
                              Predicate pred<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        InputIterator find_if_not<span class="br0">(</span>InputIterator first, InputIterator last,
                                  Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">&gt;</span>
        ForwardIterator1
        find_end<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
                 ForwardIterator2 first2, ForwardIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2,
             <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        ForwardIterator1
        find_end<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
                 ForwardIterator2 first2, ForwardIterator2 last2,
                 BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        InputIterator
        find_first_of<span class="br0">(</span>InputIterator first1, InputIterator last1,
                      ForwardIterator first2, ForwardIterator last2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> ForwardIterator,
             <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        InputIterator
        find_first_of<span class="br0">(</span>InputIterator first1, InputIterator last1,
                      ForwardIterator first2, ForwardIterator last2,
                      BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        ForwardIterator adjacent_find<span class="br0">(</span>ForwardIterator first,
                                      ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        ForwardIterator adjacent_find<span class="br0">(</span>ForwardIterator first,
                                      ForwardIterator last,
                                      BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        <span class="kw1">typename</span> iterator_traits<span class="sy1">&lt;</span>InputIterator<span class="sy1">&gt;</span><span class="sy4">::</span><span class="me2">difference_type</span>
        count<span class="br0">(</span>InputIterator first, InputIterator last, <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        <span class="kw1">typename</span> iterator_traits<span class="sy1">&lt;</span>InputIterator<span class="sy1">&gt;</span><span class="sy4">::</span><span class="me2">difference_type</span>
        count_if<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>InputIterator1, InputIterator2<span class="sy1">&gt;</span>
        mismatch<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                 InputIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>InputIterator1, InputIterator2<span class="sy1">&gt;</span>
        mismatch<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                 InputIterator2 first2, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> equal<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                   InputIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> equal<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                   InputIterator2 first2, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> is_permutation<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
                            ForwardIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2,
    <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> is_permutation<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
                            ForwardIterator2 first2, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">&gt;</span>
        ForwardIterator1 search<span class="br0">(</span>
            ForwardIterator1 first1, ForwardIterator1 last1,
            ForwardIterator2 first2, ForwardIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2,
             <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        ForwardIterator1 search<span class="br0">(</span>
            ForwardIterator1 first1, ForwardIterator1 last1,
            ForwardIterator2 first2, ForwardIterator2 last2,
            BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        ForwardIterator search_n<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                 Size count, <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> T, <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        ForwardIterator1 search_n<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                  Size count, <span class="kw4">const</span> T<span class="sy3">&amp;</span> value,
                                  BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// modifying sequence operations:</span>
 
    <span class="co1">// copy:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator copy<span class="br0">(</span>InputIterator first, InputIterator last,
                            OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator copy_n<span class="br0">(</span>InputIterator first, Size n,
                              OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        OutputIterator copy_if<span class="br0">(</span>InputIterator first, InputIterator last,
                               OutputIterator result, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator1, <span class="kw1">class</span> BidirectionalIterator2<span class="sy1">&gt;</span>
        BidirectionalIterator2 copy_backward<span class="br0">(</span>
            BidirectionalIterator1 first, BidirectionalIterator1 last,
            BidirectionalIterator2 result<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// move:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator move<span class="br0">(</span>InputIterator first, InputIterator last,
                            OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator1, <span class="kw1">class</span> BidirectionalIterator2<span class="sy1">&gt;</span>
        BidirectionalIterator2 move_backward<span class="br0">(</span>
            BidirectionalIterator1 first, BidirectionalIterator1 last,
            BidirectionalIterator2 result<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// swap:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">&gt;</span>
        ForwardIterator2 swap_ranges<span class="br0">(</span>ForwardIterator1 first1,
                                     ForwardIterator1 last1, ForwardIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">&gt;</span>
        <span class="kw4">void</span> iter_swap<span class="br0">(</span>ForwardIterator1 a, ForwardIterator2 b<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> UnaryOperation<span class="sy1">&gt;</span>
        OutputIterator transform<span class="br0">(</span>InputIterator first, InputIterator last,
                                 OutputIterator result, UnaryOperation op<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
             <span class="kw1">class</span> BinaryOperation<span class="sy1">&gt;</span>
        OutputIterator transform<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                                 InputIterator2 first2, OutputIterator result,
                                 BinaryOperation binary_op<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        <span class="kw4">void</span> replace<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                     <span class="kw4">const</span> T<span class="sy3">&amp;</span> old_value, <span class="kw4">const</span> T<span class="sy3">&amp;</span> new_value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        <span class="kw4">void</span> replace_if<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                        Predicate pred, <span class="kw4">const</span> T<span class="sy3">&amp;</span> new_value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        OutputIterator replace_copy<span class="br0">(</span>InputIterator first, InputIterator last,
                                    OutputIterator result,
                                    <span class="kw4">const</span> T<span class="sy3">&amp;</span> old_value, <span class="kw4">const</span> T<span class="sy3">&amp;</span> new_value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Predicate, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        OutputIterator replace_copy_if<span class="br0">(</span>InputIterator first, InputIterator last,
                                       OutputIterator result,
                                       Predicate pred, <span class="kw4">const</span> T<span class="sy3">&amp;</span> new_value<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        <span class="kw4">void</span> fill<span class="br0">(</span>ForwardIterator first, ForwardIterator last, <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        OutputIterator fill_n<span class="br0">(</span>OutputIterator first, Size n, <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Generator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> generate<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                      Generator gen<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> Generator<span class="sy1">&gt;</span>
        OutputIterator generate_n<span class="br0">(</span>OutputIterator first, Size n, Generator gen<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        ForwardIterator remove<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                               <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        ForwardIterator remove_if<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                  Predicate pred<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        OutputIterator remove_copy<span class="br0">(</span>InputIterator first, InputIterator last,
                                   OutputIterator result, <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        OutputIterator remove_copy_if<span class="br0">(</span>InputIterator first, InputIterator last,
                                      OutputIterator result, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        ForwardIterator unique<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        ForwardIterator unique<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                               BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator unique_copy<span class="br0">(</span>InputIterator first, InputIterator last,
                                   OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> BinaryPredicate<span class="sy1">&gt;</span>
        OutputIterator unique_copy<span class="br0">(</span>InputIterator first, InputIterator last,
                                   OutputIterator result, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> reverse<span class="br0">(</span>BidirectionalIterator first, BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator reverse_copy<span class="br0">(</span>BidirectionalIterator first,
                                    BidirectionalIterator last,
                                    OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        ForwardIterator rotate<span class="br0">(</span>ForwardIterator first, ForwardIterator middle,
                               ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator rotate_copy<span class="br0">(</span>
            ForwardIterator first, ForwardIterator middle,
            ForwardIterator last, OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> random_shuffle<span class="br0">(</span>RandomAccessIterator first,
                            RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> RandomNumberGenerator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> random_shuffle<span class="br0">(</span>RandomAccessIterator first,
                            RandomAccessIterator last,
                            RandomNumberGenerator<span class="sy3">&amp;&amp;</span> rand<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> UniformRandomNumberGenerator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> shuffle<span class="br0">(</span>RandomAccessIterator first,
                     RandomAccessIterator last,
                     UniformRandomNumberGenerator<span class="sy3">&amp;&amp;</span> rand<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// partitions:</span>
    <span class="kw1">template</span> <span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> is_partitioned<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        ForwardIterator partition<span class="br0">(</span>ForwardIterator first,
                                  ForwardIterator last,
                                  Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        BidirectionalIterator stable_partition<span class="br0">(</span>BidirectionalIterator first,
                                               BidirectionalIterator last,
                                               Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span> <span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator1,
              <span class="kw1">class</span> OutputIterator2, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>OutputIterator1, OutputIterator2<span class="sy1">&gt;</span>
        partition_copy<span class="br0">(</span>InputIterator first, InputIterator last,
                       OutputIterator1 out_true, OutputIterator2 out_false,
                       Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate<span class="sy1">&gt;</span>
        ForwardIterator partition_point<span class="br0">(</span>ForwardIterator first,
                                        ForwardIterator last,
                                        Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// sorting and related operations:</span>
 
    <span class="co1">// sorting:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
                  Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> stable_sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> stable_sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
                         Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> partial_sort<span class="br0">(</span>RandomAccessIterator first,
                          RandomAccessIterator middle,
                          RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> partial_sort<span class="br0">(</span>RandomAccessIterator first,
                          RandomAccessIterator middle,
                          RandomAccessIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        RandomAccessIterator partial_sort_copy<span class="br0">(</span>
            InputIterator first, InputIterator last,
            RandomAccessIterator result_first,
            RandomAccessIterator result_last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        RandomAccessIterator partial_sort_copy<span class="br0">(</span>
            InputIterator first, InputIterator last,
            RandomAccessIterator result_first,
            RandomAccessIterator result_last,
            Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> is_sorted<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> is_sorted<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                       Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        ForwardIterator is_sorted_until<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        ForwardIterator is_sorted_until<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                        Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> nth_element<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator nth,
                         RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> nth_element<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator nth,
                         RandomAccessIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="co1">// binary search:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        ForwardIterator lower_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                    <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        ForwardIterator lower_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                    <span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        ForwardIterator upper_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                    <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        ForwardIterator upper_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                    <span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>ForwardIterator, ForwardIterator<span class="sy1">&gt;</span>
        equal_range<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                    <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>ForwardIterator, ForwardIterator<span class="sy1">&gt;</span>
        equal_range<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                    <span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> binary_search<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                           <span class="kw4">const</span> T<span class="sy3">&amp;</span> value<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> binary_search<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                           <span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// merge:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator merge<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                             InputIterator2 first2, InputIterator2 last2,
                             OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
            <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        OutputIterator merge<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                             InputIterator2 first2, InputIterator2 last2,
                             OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> inplace_merge<span class="br0">(</span>BidirectionalIterator first,
                           BidirectionalIterator middle,
                           BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> inplace_merge<span class="br0">(</span>BidirectionalIterator first,
                           BidirectionalIterator middle,
                           BidirectionalIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// set operations:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> includes<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                      InputIterator2 first2, InputIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> includes<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator set_union<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                                 InputIterator2 first2, InputIterator2 last2,
                                 OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
             <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        OutputIterator set_union<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
                                 InputIterator2 first2, InputIterator2 last2,
                                 OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator set_intersection<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2,
            OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
             <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        OutputIterator set_intersection<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2,
            OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator set_difference<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2,
            OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
             <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        OutputIterator set_difference<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2,
            OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">&gt;</span>
        OutputIterator set_symmetric_difference<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2,
            OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
             <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        OutputIterator set_symmetric_difference<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2,
            OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// heap operations:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> push_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> push_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
                       Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> pop_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> pop_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
                      Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> make_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> make_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
                       Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">void</span> sort_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">void</span> sort_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
                       Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> is_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> is_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">&gt;</span>
        RandomAccessIterator is_heap_until<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        RandomAccessIterator is_heap_until<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
                                           Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="co1">// minimum and maximum:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T<span class="sy1">&gt;</span> <span class="kw4">const</span> T<span class="sy3">&amp;</span> min<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&amp;</span> a, <span class="kw4">const</span> T<span class="sy3">&amp;</span> b<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">const</span> T<span class="sy3">&amp;</span> min<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&amp;</span> a, <span class="kw4">const</span> T<span class="sy3">&amp;</span> b, Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T<span class="sy1">&gt;</span>
        T min<span class="br0">(</span>initializer_list<span class="sy1">&lt;</span>T<span class="sy1">&gt;</span> t<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        T min<span class="br0">(</span>initializer_list<span class="sy1">&lt;</span>T<span class="sy1">&gt;</span> t, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T<span class="sy1">&gt;</span> <span class="kw4">const</span> T<span class="sy3">&amp;</span> max<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&amp;</span> a, <span class="kw4">const</span> T<span class="sy3">&amp;</span> b<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">const</span> T<span class="sy3">&amp;</span> max<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&amp;</span> a, <span class="kw4">const</span> T<span class="sy3">&amp;</span> b, Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T<span class="sy1">&gt;</span>
        T max<span class="br0">(</span>initializer_list<span class="sy1">&lt;</span>T<span class="sy1">&gt;</span> t<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        T max<span class="br0">(</span>initializer_list<span class="sy1">&lt;</span>T<span class="sy1">&gt;</span> t, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T<span class="sy1">&gt;</span> pair<span class="sy1">&lt;</span><span class="kw4">const</span> T<span class="sy3">&amp;</span>, <span class="kw4">const</span> T<span class="sy3">&amp;</span><span class="sy1">&gt;</span> minmax<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&amp;</span> a, <span class="kw4">const</span> T<span class="sy3">&amp;</span> b<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span><span class="kw4">const</span> T<span class="sy3">&amp;</span>, <span class="kw4">const</span> T<span class="sy3">&amp;</span><span class="sy1">&gt;</span> minmax<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&amp;</span> a, <span class="kw4">const</span> T<span class="sy3">&amp;</span> b, Compare comp<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>T, T<span class="sy1">&gt;</span> minmax<span class="br0">(</span>initializer_list<span class="sy1">&lt;</span>T<span class="sy1">&gt;</span> t<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>T, T<span class="sy1">&gt;</span> minmax<span class="br0">(</span>initializer_list<span class="sy1">&lt;</span>T<span class="sy1">&gt;</span> t, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        ForwardIterator min_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        ForwardIterator min_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                    Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        ForwardIterator max_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        ForwardIterator max_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
                                    Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>ForwardIterator, ForwardIterator<span class="sy1">&gt;</span>
        minmax_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        pair<span class="sy1">&lt;</span>ForwardIterator, ForwardIterator<span class="sy1">&gt;</span>
        minmax_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> lexicographical_compare<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> lexicographical_compare<span class="br0">(</span>
            InputIterator1 first1, InputIterator1 last1,
            InputIterator2 first2, InputIterator2 last2,
            Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="co1">// permutations:</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> next_permutation<span class="br0">(</span>BidirectionalIterator first,
                              BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> next_permutation<span class="br0">(</span>BidirectionalIterator first,
                              BidirectionalIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> prev_permutation<span class="br0">(</span>BidirectionalIterator first,
                              BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
    <span class="kw1">template</span><span class="sy1">&lt;</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Compare<span class="sy1">&gt;</span>
        <span class="kw4">bool</span> prev_permutation<span class="br0">(</span>BidirectionalIterator first,
                              BidirectionalIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span></pre></div></div>

<!-- 
NewPP limit report
Preprocessor visited node count: 12024/1000000
Preprocessor generated node count: 8195/1000000
Post‐expand include size: 425991/2097152 bytes
Template argument size: 98597/2097152 bytes
Highest expansion depth: 20/40
Expensive parser function count: 0/100
-->

<!-- Saved in parser cache with key mwiki1-mwiki_en_:pcache:idhash:9750-0!*!0!!en!*!* and timestamp 20140623074427 -->
</div>                    <!-- /bodycontent -->
                                        <!-- printfooter -->
                    <div class="printfooter">
                    Retrieved from "<a href="http%3A//en.cppreference.com/mwiki/index.php">http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&amp;oldid=57426</a>"                    </div>
                    <!-- /printfooter -->
                                                            <!-- catlinks -->
                    <div id="catlinks" class="catlinks catlinks-allhidden"></div>                    <!-- /catlinks -->
                                                            <div class="visualClear"></div>
                    <!-- debughtml -->
                                        <!-- /debughtml -->
                </div>
                <!-- /bodyContent -->
            </div>
        </div>
        <!-- /content -->
        <!-- footer -->
        
        <!-- /footer -->
        <script>if(window.mw){
mw.loader.state({"site":"loading","user":"missing","user.groups":"ready"});
}</script>
<script src="../../../common/skin_scripts.js"></script>
<script>if(window.mw){
mw.loader.load(["mediawiki.action.view.postEdit","mediawiki.user","mediawiki.page.ready","mediawiki.searchSuggest","mediawiki.hidpi","ext.gadget.ColiruCompiler"], null, true);
}</script>
<script src="../../../common/site_scripts.js"></script>

<script type="text/javascript">
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-2828341-1']);
_gaq.push(['_setDomainName', 'cppreference.com']);
_gaq.push(['_trackPageview']);
</script><!-- Served in 3.488 secs. -->
	</body>
<!-- Cached 20140623074427 -->
</html>
